Matrices. Abelian Group of Matrices

The articles [11], [6], [13], [14], [4], [5], [2], [10], [8], [3], [7], [12], [9], and [1] provide the notation and terminology for this paper. For simplicity, we follow the rules: x is a set, i, j, n, m are natural numbers, D is a non empty set, K is a non empty double loop structure, s is a finite sequence, a, a1, a2, b1, b2, d are elements of D, p, p1, p2 are finite sequences of elements of D, and F is an add-associative right zeroed right complementable Abelian non empty double loop structure. Let f be a finite sequence. We say that f is tabular if and only if: (Def. 1) There exists a natural number n such that for every x such that x ∈ rng f there exists s such that s = x and lens = n.